A Coalgebraic Decision Procedure for NetKAT
نویسندگان
چکیده
منابع مشابه
A Coalgebraic Decision Procedure for WS1S
Weak monadic second-order logic of one successor (WS1S) is a simple and natural formalism to specify regular properties. WS1S is decidable, although the decision procedure’s complexity is non-elementary. Typically, decision procedures for WS1S exploit the logic–automaton connection, i.e., they escape the simple and natural formalism by translating formulas into equally expressive regular struct...
متن کاملProbabilistic Program Equivalence for NetKAT
We study the problem of deciding program equivalence in the context of Probabilistic NetKAT, a formal language for reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language, and discuss a path toward a decision procedure for the full language. The main challenge lies in reasoning about iteration, which we addres...
متن کاملA goal programming procedure for ranking decision making units in DEA
This research proposes a methodology for ranking decision making units byusing a goal programming model.We suggest a two phases procedure. In phase1, by using some DEA problems for each pair of units, we construct a pairwisecomparison matrix. Then this matrix is utilized to rank the units via the goalprogramming model.
متن کاملProbabilistic NetKAT
This paper develops a new language for programming softwaredefined networks based on a probabilistic semantics. We extend the NetKAT language with new primitives for expressing probabilistic behaviors and enrich the semantics from one based on deterministic functions to one based on measures and measurable functions on sets of packet histories. We establish fundamental properties of the semanti...
متن کاملA Decision Procedure for Structured Cryptographic Protocols
Given a cryptographic protocol, it is possible to extract an inference system modelling exactly the set of messages an active intruder can learn by manipulating this protocol. Unfortunately, there is no general proof-search procedure to test whether or not a term belongs to the theory of an inference system. This paper presents the preliminary results obtained during an attempt to circumvent th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2775051.2677011